std::unordered_multiset::erase
From Cppreference
< cpp | container | unordered multiset
| void erase( iterator position );
iterator erase( const_iterator position ); | (1) | (C++0x feature) |
| void erase( iterator first, iterator last );
iterator erase( const_iterator first, const_iterator last ); | (2) | (C++0x feature) |
| size_type erase( const key_type& key );
| (3) | (C++0x feature) |
Removes specified elements from the container.
1) Removes the element at pos.
2) Removes the elements in the range [first; last).
3) Removes the elements with the key value key
Contents |
Parameters
| pos | - | iterator to the element to remove |
| first, last | - | range of elements to remove |
| key | - | key value of the elements to remove |
Return value
1-2) iterator following the last removed element.
3) number of elements removed
Complexity
1) average case: constant , worst case: a.size()
2) average case: std::distance(first, last) , worst case: a.size()
3) average case: a.count(key) , worst case: a.size()
See also
| clears the contents (public member function) | |
